A Superfair Division of Cake
نویسندگان
چکیده
Given a cake and two players with different measures of cake value, we describe a practical procedure that yields a superfair partition. That is, each player receives more than half of the cake, according to his measure. The players need not reveal their measures, and the procedure resists strategic play. The procedure is easily modified to partition something undesirable (a “chore”) in a superfair way: each player is assigned less than half of the work, by his measure.
منابع مشابه
Exact Procedures for Envy-free Chore Division
We develop the rst explicit procedures for exact envy-free chore division for 4 or more players. We also give a simple 3-person procedure. Our 4-person moving-knife scheme and n-person discrete algorithm are accomplished by exploiting a notion of \irrevocable advantage" for chores, and are motivated by similar solutions for cake-cutting by Brams, Taylor, and Zwicker. We discuss the diierences b...
متن کاملCake Cutting - Fair and Square
The classic fair cake-cutting problem [Steinhaus, 1948] is extended by introducing geometric constraints on the allocated pieces. Specifically, agents may demand to get their share as a square or a rectangle with a bounded length/width ratio. This is a plausible constraint in realistic cake-cutting applications, notably in urban and agricultural economics where the “cake” is land. Geometric con...
متن کاملN-Person Cake-Cutting: There May Be No Perfect Division
A cake is a metaphor for a heterogeneous, divisible good, such as land. A perfect division of cake is efficient (also called Pareto-optimal), envyfree, and equitable. We give an example of a cake in which it is impossible to divide it among three players such that these three properties are satisfied, however many cuts are made. It turns out that two of the three properties can be satisfied by ...
متن کاملCake Cutting ∗
In the 2nd world war, if you’re a collection of Polish mathematicians sitting out the war in Lvov, your thoughts naturally turn to ... cake. Or more precisely, how to cut a cake. This is the beginning of what we now call the problem of “fair division”. Fair division algorithms are examples of what we might now call a mechanism, much like an auction. These are protocols designed to allocate reso...
متن کاملN-person Envy-free Chore Division
In this paper we consider the problem of chore division, which is closely related to a classical question, due to Steinhaus [7], of how to cut a cake fairly. We focus on constructive solutions, i.e., those obtained via a well-defined procedure or algorithm. Among the many notions of fairness is envy-freeness: an envy-free cake division is a set of cuts and an allocation of the pieces that gives...
متن کامل